Cyclically Pinched One-relator Groups and Generic Property Soyoung Moon
نویسنده
چکیده
We show that a class of cyclically pinched one-relator groups admits amenable, faithful and transitive actions on infinite countable sets. This work generalizes the results on such actions for doubles of free group on 2 generators.
منابع مشابه
On the Surface Group Conjecture
We consider the following conjecture. Suppose that G is a non-free non-cyclic onerelator group such that each subgroup of finite index is again a one-relator group and each subgroup of infinite index is a free group. Must G be a surface group? We show that if G is a freely indecomposable fully residually free group and satisfies the property that every subgroup of infinite index is free then G ...
متن کاملVirtual Properties of cyclically pinched One-Relator Groups
We prove that the amalgamated product of free groups with cyclic amalgamations satisfying certain conditions are virtually free-by-cyclic. In case the cyclic amalgamated subgroups lie outside the derived group such groups are free-by-cyclic. Similarly a one-relator HNN-extension in which the conjugated elements either coincide or are independent modulo the derived group is shown to be free-by-c...
متن کاملOne-relator Quotients and Free Products of Cyclics
It is proven that the Freiheitssatz holds for all one-relator products of cyclic groups if the relator is cyclically reduced and a proper power. The method of proof involves representing such groups in PSL2(C) and is a refinement of a technique of Baumslag, Morgan and Shalen. The technique allows the extension of the Freiheitssatz result to many additional one-relator products.
متن کاملOn One-relator Inverse Monoids and One-relator Groups
It is known that the word problem for one-relator groups and for one-relator monoids of the form Mon〈A ‖ w = 1〉 is decidable. However, the question of decidability of the word problem for general one-relation monoids of the form M = Mon〈A ‖ u = v〉 where u and v are arbitrary (positive) words in A remains open. The present paper is concerned with one-relator inverse monoids with a presentation o...
متن کاملGeneric properties of Whitehead's Algorithm and isomorphism rigidity of random one-relator groups
We prove that Whitehead’s algorithm for solving the automorphism problem in a fixed free group Fk has strongly linear time generic-case complexity. This is done by showing that the “hard” part of the algorithm terminates in linear time on an exponentially generic set of input pairs. We then apply these results to one-relator groups. We obtain a Mostow-type isomorphism rigidity result for random...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009